A framework for designing deadlock-free wormhole routing algorithms
نویسندگان
چکیده
منابع مشابه
A Framework for Designing Deadlock-Free Wormhole Routing Algorithms
This paper presents a framework to design fully-adaptive, deadlock-free wormhole algorithms for a variety of network topologies. The main theoretical contributions are (a) design of new wormhole algorithms using store-and-forward algorithms, (b) a sufficient condition for deadlock free routing by the wormhole algorithms so designed, and (c) a sufficient condition for deadlock free routing by th...
متن کاملDeadlock-free wormhole routing algorithms for star graph topology
For constructing massively parallel multicomputers with over 5000 processing nodes, the Star Graph topology is known to be better than the hypercube in terms of the average routing distance, the number of links per node, and the fault diameter. The authors present two deadlock-free algorithms for routing in Star Graph, assuming the Wormhole routing model. Both the algorithms use the concept of ...
متن کاملDesigning Deadlock-Free Turn-Restricted Routing Algorithms for Irregular Wormhole-routed Networks
Irregular networks connected by wormhole-routed switches are becoming increasingly popular for building networks of workstations for cost-effective parallel processing. A primary strategy to achieve deadlock-free routing in such networks is to first configure the links in a network into some specific directions, and then prohibit the turns that a message may traverse. A routing algorithm impose...
متن کاملDeadlock-free Multicast Wormhole Routing in Multicomputer Networks Deadlock-free Multicast Wormhole Routing in Multicomputer Networks
EEcient routing of messages is the key to the performance of multicomputers. Mul-ticast communication refers to the delivery of the same message from a source node to an arbitrary number of destination nodes. Wormhole routing is the most promising switching technique used in new generation multicomputers. In this paper, we present multicast wormhole routing methods for multicomputers adopting 2...
متن کاملHierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing
Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be signiicant, discouraging its use in commercial massively parallel systems. In this paper, we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework, which provides a uni-ed framework for simple and hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 1996
ISSN: 1045-9219
DOI: 10.1109/71.485506